Real Time Efficient Scheduling Algorithm for Load Balancing in Fog Computing Environment

نویسندگان

  • Manisha Verma
  • Neelam Bhardwaj
  • Arun Kumar Yadav
چکیده

Cloud computing is the new era technology, which is entirely dependent on the internet to maintain large applications, where data is shared over one platform to provide better services to clients belonging to a different organization. It ensures maximum utilization of computational resources by making availability of data, software and infrastructure with lower cost in a secure, reliable and flexible manner. Though cloud computing offers many advantages, but it suffers from certain limitation too, that during load balancing of data in cloud data centers the internet faces problems of network congestion, less bandwidth utilization, fault tolerance and security etc. To get rid out of this issue new computing model called Fog Computing is introduced which easily transfer sensitive data without delaying to distributed devices. Fog is similar to the cloud only difference lies in the fact that it is located more close to end users to process and give response to the client in less time. Secondly, it is beneficial to the real time streaming applications, sensor networks, Internet of things which need high speed and reliable internet connectivity. Our proposed architecture introduced a new scheduling policy for load balancing in Fog Computing environment, which complete real tasks within deadline, increase throughput and network utilization, maintaining data consistency with less complexity to meet the present day demand of end users.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment

The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...

متن کامل

GASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment

The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016